The Shortest Common Parameterized Supersequence Problem
نویسنده
چکیده
In this paper, we consider the problem of the shortest common parameterized supersequence. In particular, we consider an explicit reduction from the problem to the satisfiability problem.
منابع مشابه
Parameterized Complexity and Biopolymer Sequence Comparison
The article surveys parameterized algorithms and complexities for computational tasks on biopolymer sequences, including the problems of longest common subsequence, shortest common supersequence, pairwise sequence alignment, multiple sequencing alignment, structure-sequence alignment, and structure-structure alignment. Algorithm techniques built on the structural-unit level, as well as on the r...
متن کاملOn the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
We show that the Fixed Alphabet Shortest Common Supersequence (SCS) and the Fixed Alphabet Longest Common Subsequence (LCS) problems parameterized in the number of strings are W [1]-hard. Unless W [1] = FPT , this rules out the existence of algorithms with time complexity of O(f(k)n) for those problems. Here n is the size of the problem instance, α is constant, k is the number of strings and f ...
متن کاملProblems Related to Subsequences and Supersequences
We present an algorithm for building the automaton that searches for all non-overlapping occurrences of each subsequence from the set of subsequences. Further, we define Directed Acyclic Supersequence Graph and use it to solve the generalized Shortest Common Supersequence problem, the Longest Common Non-Supersequence problem, and the Longest Consistent Supersequence problem.
متن کاملSolving Shortest Common Supersequence Problem Using Artificial Bee Colony Algorithm
The idea behind this work is to solve the Shortest Common Supersequence by using Artificial Bee Colony (ABC) Algorithm. This algorithm is considered as one of the newest nature-inspired swarm-based optimization algorithms and has a promising performance [6]. Shortest Common Supersequence is a classical problem in the field of strings and it is classified as NP-Hard problem [12]. Many algorithms...
متن کاملAnalogs & Duals of the MAST Problem
Two natural kinds of problems about \structured collections of symbols" can be generally refered to as the Largest Common Sub-object and the Smallest Common Superobject problems, which we consider here as the dual problems of interest. For the case of rooted binary trees where the symbols occur as leaf-labels and a subobject is deened by label-respecting hereditary topological containment, both...
متن کامل